#include "HashTable.h"
#include "unordered_set.h"
#include "unordered_map.h"
int main()
{
	//hash_bucket::HashTable<int, int> ht1;
	//int a[] = { 3,1,6,7,8,2,1,1,5,6,7,6 };
	/*ht1.Insert(0);
	ht1.Insert(1);
	ht1.Insert(52);
	hash_bucket::HashTable<int, int> ht2(ht1);
	hash_bucket::HashTable<int, int> ht3;
	ht3 = ht1;*/
	//cout<< ht1.Find(1) << endl;
	//<< ht1.Find(2) << endl;
	//ht1.Erase(1);
	/*bit::unordered_set<int> us;
	bit::unordered_map<int ,int> um;
	int a[] = { 1,4,67,2,5,8,0,25 };
	for (int i = 0; i < 19; i++)
	{
		um.insert({ i,i });
	}
	um[0] = 10000;
	bit::unordered_map<int ,int>::iterator it = um.begin();
	while (it != um.end())
	{
		cout << (*it).second << endl;
		++it;
	}*/
	bit::unordered_set<int> us;
	int a[] = { 1,4,67,2,5,8,0,25 };
	int sz = sizeof(a) / sizeof(int);
	for (int i = 0; i < sz; i++)
	{
		us.insert(a[i]);
	}
	//const int c = 0;
	bit::unordered_set<int>::iterator it = us.begin();
	while (it != us.end())
	{
		cout << *it << " ";
		++it;
	}
	return 0;
}